A fast scalable automaton-matching accelerator for embedded content processors
نویسندگان
چکیده
منابع مشابه
Scalable Vector Processors for Embedded Systems
Designers of embedded processors have typically optimized for low power consumption and low design complexity to minimize cost. Performance was a secondary consideration. Nowadays, many embedded systems (set-top boxes, game consoles, personal digital assistants, and cell phones) commonly perform computation-intensive media tasks such as video processing, speech transcoding, graphics, and high-b...
متن کاملA Fast Asynchronous Huffman Decoder for Compressed-Code Embedded Processors
This paper presents the architecture and design of a high-performance asynchronous Huffman decoder for compressed-code embedded processors. In such processors, embedded programs are stored in compressed form in instruction ROM, then are decompressed on demand during instruction cache refill. The Huffman decoder is used as a code decompression engine. The circuit is non-pipelined, and is impleme...
متن کاملA fast block matching for SIMD processors using subsampling
A new block matching (BM) algorithm for motion estimation (ME) is introduced in this paper. This algorithm is formed of two different steps: the first step considers, inside the search window, a fewer number of pixels rather than the Full Search Algorithm (FSA); the second step considers a sub-sampled Macroblock (MB) for the operations that contribute to determine the Mean Absolute Difference (...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملFast software multiplication in F2[x] for embedded processors
We present a novel method for fast multiplication of polynomials over 2 which can be implemented efficiently in embedded software. Fast polynomial multiplication methods are needed for the efficient implementation of some cryptographic and coding applications. The proposed method follows a strategy to reduce the memory accesses for input data and intermediate values during computation. This str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Embedded Computing Systems
سال: 2009
ISSN: 1539-9087,1558-3465
DOI: 10.1145/1509288.1509291